Efficient solution of Boolean satisfiability problems with digital memcomputing
نویسندگان
چکیده
منابع مشابه
Efficient Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technological limitations, genotype data rather than haplotype data is usually obtained. The haplotype inference by pure parsimony (HIPP) problem consists in inferring haplotypes from genotypes s.t. the number of required hapl...
متن کاملPolynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines.
We introduce a class of digital machines, we name Digital Memcomputing Machines, (DMMs) able to solve a wide range of problems including Non-deterministic Polynomial (NP) ones with polynomial resources (in time, space, and energy). An abstract DMM with this power must satisfy a set of compatible mathematical constraints underlying its practical realization. We prove this by making a connection ...
متن کاملSimulation of Analog Solution of Boolean Satisfiability
We present an analog implementation of a dynamical system for solving Boolean satisfiability, an NP-complete problem. Simulations of modest-sized hardware implementations in the presence of noise and integrator offset demonstrate that the algorithm is suitable for implementation in analog electronics. ∗This report may be used for any non-profit purpose provided that the source is credited. 1
متن کاملOn Solving Optimization Problems Using Boolean Satisfiability
The last few years have seen significant advances in Boolean satisfiability (SAT) solving. This has lead to the successful deployment of SAT solvers in a wide range of problems in Engineering and Computer Science. In general, most SAT solvers are applied to Boolean decision problems that are expressed in conjunctive normal form (CNF). While this input format is applicable to some engineering ta...
متن کاملThe Quest for Efficient Boolean Satisfiability Solvers
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical solutions to this problem enable significant practical applications. Since the first development of the basic search based algorithm proposed by Davis, Putnam, Logemann and Loveland (DPLL) about forty years ago, this a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2020
ISSN: 2045-2322
DOI: 10.1038/s41598-020-76666-2